翻訳と辞書
Words near each other
・ Consistency (disambiguation)
・ Consistency (knowledge bases)
・ Consistency (negotiation)
・ Consistency (statistics)
・ Consistency (suspension)
・ Consistency criterion
・ Consistency model
・ Consistency Theory
・ Consistent and inconsistent equations
・ Consistent estimator
・ Consistent hashing
・ Consistent heuristic
・ Consistent histories
・ Consistent life ethic
・ Consistent Network Device Naming
Consistent Overhead Byte Stuffing
・ Consistent pricing process
・ Consistori de Barcelona
・ Consistori del Gay Saber
・ Consistory
・ Consistory (Judaism)
・ Consistory (Protestantism)
・ Consistory court
・ Consociationalism
・ Consol
・ Consol (bond)
・ Consol Energy
・ Consol Energy Center
・ Consol Energy Mine Map Preservation Project
・ Consol Energy Park


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Consistent Overhead Byte Stuffing : ウィキペディア英語版
Consistent Overhead Byte Stuffing

Consistent Overhead Byte Stuffing (COBS) is an algorithm for encoding data bytes that results in efficient, reliable, unambiguous packet framing regardless of packet content, thus making it easy for receiving applications to recover from malformed packets. It employs a particular byte value, typically zero, to serve as a packet delimiter. When zero is used as a delimiter, the algorithm replaces each zero byte with a value equal to one plus the number of non-zero bytes that follow.
Byte stuffing is a process that transforms a sequence of data bytes that may contain 'illegal' or 'reserved' values into a potentially longer sequence that contains no occurrences of those values. The extra length of the transformed sequence is typically referred to as the overhead of the algorithm. The COBS algorithm tightly bounds the worst-case overhead, limiting it to no more than one byte in 254. The algorithm is computationally inexpensive and its average overhead is low compared to other unambiguous framing algorithms.〔
〕〔

==Packet framing and stuffing==

When packet data is sent over any serial medium, a protocol is needed by which to demarcate packet boundaries. This is done by using a special bit-sequence or character value to indicate where the boundaries between packets fall. Data stuffing is the process that transforms the packet data before transmission to eliminate any accidental occurrences of that special framing marker, so that when the receiver detects the marker, it knows, without any ambiguity, that it does indeed indicate a boundary between packets.
COBS takes an input consisting of bytes in the range () and produces an output consisting of bytes only in the range (). Having eliminated all zero bytes from the data, a zero byte can now be used unambiguously to mark boundaries between packets. This allows the receiver to synchronize reliably with the beginning of the next packet, even after an error. It also allows new listeners, which might join a broadcast stream at any time, to reliably detect the beginning of the first complete packet in the received byte stream.
With COBS, all packets up to 254 bytes in length are encoded with an overhead of exactly one byte. For packets over 254 bytes in length the overhead is at most one byte for every 254 bytes of packet data. The maximum overhead is therefore roughly 0.4% of the packet size, rounded up to a whole number of bytes. COBS encoding has low overhead (on average 0.23% of the packet size, rounded up to a whole number of bytes) and furthermore, for packets of any given length, the amount of overhead is constant regardless of packet content.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Consistent Overhead Byte Stuffing」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.